Gossip over holonomic graphs

A gossip process is an iterative in a multi-agent system where only two neighboring agents communicate at each iteration and update their states. The condition by convention described undirected graph. In this paper, we consider general rule whereby agent takes arbitrary weighted average of its neighbor’s current general, the limit (if it converges) depends on order iterations gossiping pairs. main contribution paper to provide necessary sufficient for convergence that independent iterations. This result relies introduction novel notion holonomy local stochastic matrices communication We also complete characterizations space holonomic over